Finding Large Expanders in Graphs: from Topological Minors to Induced Subgraphs
نویسندگان
چکیده
In this paper, we consider a structural and geometric property of graphs, namely the presence large expanders. The problem finding such structures was first considered by Krivelevich [SIAM J. Disc. Math. 32 1 (2018)]. Here, show that induced subgraph is an expander can be reduced to simpler topological minor expander. Our proof constructive, which helpful in algorithmic setting.
 We also every graph contains itself
منابع مشابه
Topological Minors in Graphs of Large Girth
We prove that every graph of minimum degree at least r and girth at least 186 contains a subdivision of Krþ1 and that for r5435 a girth of at least 15 suffices. This implies that the conjecture of Haj ! os that every graph of chromatic number at least r contains a subdivision of Kr (which is false in general) is true for graphs of girth at least 186 (or 15 if r5436). More generally, we show tha...
متن کاملCompact topological minors in graphs
Let be a real number such that 0< <2 and t a positive integer. Let n be a sufficiently large positive integer as a function of t and . We show that every n-vertex graph with at least n1+ edges contains a subdivision of Kt in which each edge of Kt is subdivided less than 10/ times. This refines the main result in [A. Kostochka and Pyber, Combinatorica 8 (1988), 83–86] and resolves an open questi...
متن کاملForcing Large Complete (Topological) Minors in Infinite Graphs
It is well known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalize the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large mi...
متن کاملFinding induced subgraphs in scale-free inhomogeneous random graphs
We study the induced subgraph isomorphism problem on inhomogeneous random graphs with infinite variance power-law degrees. We provide a fast algorithm that determines for any connected graph H on k vertices if it exists as induced subgraph in a random graph with n vertices. By exploiting the scale-free graph structure, the algorithm runs in O(ne 4 ) time, and finds for constant k an instance of...
متن کاملTesting Subgraphs in Large Graphs
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n edges have to be deleted from it to make it H-free. It is known that in this case G contains at least f( ,H)n copies of H . We show that the largest possible function f( ,H) is polynomial in if and only if H is bipartite. This implies that there is a one-sided error property tester for checking H-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2023
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/10859